Optimal Reduction of Multivariate Dirac Mixture Densities
نویسندگان
چکیده
منابع مشابه
Optimal Reduction of Multivariate Dirac Mixture Densities
This paper is concerned with the optimal approximation of a given multivariate Dirac mixture, i.e., a density comprising weighted Dirac distributions on a continuous domain, by an equally weighted Dirac mixture with a reduced number of components. The parameters of the approximating density are calculated by minimizing a smooth global distance measure, a generalization of the well-known Cramér-...
متن کاملTruncated Moment Problem for Dirac Mixture Densities with Entropy Regularization
We assume that a finite set of moments of a random vector is given. Its underlying density is unknown. An algorithm is proposed for efficiently calculating Dirac mixture densities maintaining these moments while providing a homogeneous coverage of the state space.
متن کاملNonparametric estimation of multivariate elliptic densities via finite mixture sieves
This paper considers the class of p-dimensional elliptic distributions (p ≥ 1) satisfying the consistency property (Kano, 1994) and within this general framework presents a two-stage semiparametric estimator for the Lebesgue density based on Gaussian mixture sieves. Under the on-line Exponentiated Gradient (EG) algorithm of Helmbold et al. (1997) and without restricting the mixing measure to ha...
متن کاملNonparametric mixture models with conditionally independent multivariate component densities
Models and algorithms for nonparametric estimation of finite multivariate mixtures have been recently proposed, where it is usually assumed that coordinates are independent conditional on the subpopulation from which each observation is drawn. Hence in these models the dependence structure comes only from the mixture. This assumption is relaxed, allowing for independent multivariate blocks of c...
متن کاملOptimal tying of HMM mixture densities using decision trees
Decision trees have been used in speech recognition with large numbers of context-dependentHMM models, to provide models for contexts not seen in training. Trees are usually created by successive node splitting decisions, based on how well a single Gaussian or Poisson density fits the data associated with a node. We introduce a new node splitting criterion, derived from the maximum likelihood f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: at - Automatisierungstechnik
سال: 2015
ISSN: 0178-2312,2196-677X
DOI: 10.1515/auto-2015-0005